Application of State-Dependent Queues to Pedestrian/Vehicular Network Design

Real-Time Kinematic Network of Tehran, from Design to Application

Following the request of the Tehran municipality and in order to provide the spatial information required in their various projects, a real-time kinematic network has been designed for Tehran. Based on the existing measures such as the dilution of precision at the network point positions, two different designs have been proposed. A minimum number of six GNSS stations are used in both of the pro...

Analysis of Single State-Dependent Markovian Queues

Bayesian design in queues: An application to aeronautic maintenance

We exploit Bayesian criteria for designing an M/M/c//r queueing system with spares. This problem arises in many applications of the so-called machine interference problem, like job-shop type systems, telecommunication traffic, semiconductor manufacturing and transport. We exemplify our approach by a problem from aeronautic maintenance, where the numbers of repair crews c and spare planes s must...

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

Enumeration of Dominant Solutions: An Application in Transport Network Design

A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...